On a prime zeta function of a graph
نویسندگان
چکیده
منابع مشابه
Remarks on the Zeta Function of a Graph
We make two observations about the zeta function of a graph. First we show how Bass’s proof of Ihara’s formula fits into the framework of torsion of complexes. Second, we show how in the special case of those graphs that are quotients of the Bruhat-Tits tree for SL(2, K) for a local nonarchimedean field K, the zeta function has a natural expression in terms of the L-functions of Coexter systems.
متن کاملA New Bartholdi Zeta Function of a Graph
We define a new type of the Bartholdi zeta function of a graph G, and give a determinant expression of it. Furthermore, we define a new type of the Bartholdi L-function of G, and present a determinant expression for a new type of the Bartholdi L-function of G. As a corollary, we show that a new type of the Bartholdi zeta function of a regular covering of G is a product of new Batholdi L-functio...
متن کاملPrime pairs and the zeta function
Are there infinitely many prime pairs with given even difference? Most mathematicians think so. Using a strong arithmetic hypothesis, Goldston, Pintz and Yildirim have recently shown that there are infinitely many pairs of primes differing by at most sixteen. There is extensive numerical support for the prime-pair conjecture (PPC) of Hardy and Littlewood [G.H. Hardy, J.E. Littlewood, Some probl...
متن کاملON COMPOSITION FACTORS OF A GROUP WITH THE SAME PRIME GRAPH AS Ln(5)
The prime graph of a finite group $G$ is denoted by$ga(G)$. A nonabelian simple group $G$ is called quasirecognizable by primegraph, if for every finite group $H$, where $ga(H)=ga(G)$, thereexists a nonabelian composition factor of $H$ which is isomorphic to$G$. Until now, it is proved that some finite linear simple groups arequasirecognizable by prime graph, for instance, the linear groups $L_...
متن کاملCyclizing Clusters via Zeta Function of a Graph
Detecting underlying clusters from large-scale data plays a central role in machine learning research. In this paper, we tackle the problem of clustering complex data of multiple distributions and multiple scales. To this end, we develop an algorithm named Zeta l-links (Zell) which consists of two parts: Zeta merging with a similarity graph and an initial set of small clusters derived from loca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 2015
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.2015.273.123